Complexity measures in decomposable structures
نویسنده
چکیده
In this paper we present some measures of complexity of decomposable structures. The literature on complexity is reviewed and then the distinction among different measures of complexity is discussed. At first, a broad definition of complex systems is provided and the main characteristics of such systems are described briefly. In particular, a complex system is defined as a network of many highly interactive and interrelated elements, each performing its own functions. The elements are combined in such a way that each contributes to the behaviour of the structure. Moreover, the system components are characterised by interdependencies that make the contribution of each element to the overall performance (or behaviour) dependent on the contribution of the others. In general, systems are characterised by different degrees of complexity and also by different degree of decomposability. We also discuss the possibility of decomposing such complex systems, recalling the distinction that Simon (1969) made between decomposable, nondecomposable and nearly decomposable structures. Then, two particular kinds of measures are considered. The first group is based on information theory and deals with the concept of entropy. This index refers to the amount of information that we need in order to understand what is happening within a system. We claim that the entropy measure focuses only on the information complexity of a system without taking account of the interdependencies existing among the components. The second group of indicators, instead, explicitly considers this feature. Indeed, the group is composed of indexes which we call fitness measures based on the number of relevant relationships within a system. The basic features of Kauffman’s NK model are briefly reviewed. Finally, we discuss the usefulness of both entropy and Kauffman’s K value as appropriate measures of the complexity of decomposable structures. 1 We thank Michele Berardi, Roberto Gabriele, André Lorentz and Sandro Sapio for useful comments and suggestions on earlier drafts. All remaining errors are the author’s responsibility.
منابع مشابه
Designing for Complexity: Using Divisions and Hierarchy to Manage Complex Tasks
This paper studies the impact of task complexity and decomposability on the degree of organizational divisionalization and hierarchy within firms. Drawing upon the team theory and modularity literature, it argues that the degree of divisionalization is predicated not only on the extent of interdependence (complexity) among tasks but also on the extent to which those interdependent relationships...
متن کاملLogical Analysis of Data with Decomposable Structures
In such areas as knowledge discovery, data mining and logical analysis of data, methodologies to 0nd relations among attributes are considered important. In this paper, given a data set (T; F) where T ⊆ {0; 1}n denotes a set of positive examples and F ⊆ {0; 1}n denotes a set of negative examples, we propose a method to identify decomposable structures among the attributes of the data. We 0rst s...
متن کاملDecomposable Signed Fuzzy Measures
In this paper some types of decomposable signed fuzzy measures have been presented. We discuss properties of 6-and ⊕decomposable signed fuzzy measures. We consider their relationship with bi-capacities.
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملRandom Generation of Unlabelled Combinatorial Structures
A systematic method for generating unlabelled combinatorial structures uniformly at random is presented. It applies to structures that are decomposable, i.e., formally speciiable by grammars involving unions, products, sequences, multisets and cycles. All such structures of size n can be generated uniformly by either sequential algorithms of worst-case arithmetic complexity O(n 2) or by \boustr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002